By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 7, Issue 4, pp. 393-541

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs

John Bruno and Peter Downey

pp. 393-404

BibTeX  Abstract Full Text:  PDF

Polynomial Algorithms for Deterministic Pushdown Automata

Daniel J. Rosenkrantz and Harry B. Hunt III

pp. 405-412

BibTeX  Abstract Full Text:  PDF

Finding a Minimum Circuit in a Graph

Alon Itai and Michael Rodeh

pp. 413-423

BibTeX  Abstract Full Text:  PDF

Generating $t$-Ary Trees Lexicographically

Frank Ruskey

pp. 424-439

BibTeX  Abstract Full Text:  PDF

Polynomial Time Enumeration Reducibility

Alan L. Selman

pp. 440-457

BibTeX  Abstract Full Text:  PDF

Some Polynomial and Integer Divisibility Problems are $NP$-Hard

David Plaisted

pp. 458-464

BibTeX  Abstract Full Text:  PDF

Minimal-Comparison $2,3$-Trees

Arnold L. Rosenberg and Lawrence Snyder

pp. 465-480

BibTeX  Abstract Full Text:  PDF

Tree Size by Partial Backtracking

Paul W. Purdom

pp. 481-491

BibTeX  Abstract Full Text:  PDF

Ranking and Listing Algorithms for $k$-Ary Trees

Anthony E. Trojanowski

pp. 492-509

BibTeX  Abstract Full Text:  PDF

Generalized Connectors

Nicholas Pippenger

pp. 510-514

BibTeX  Abstract Full Text:  PDF

On the Loop Switching Addressing Problem

Andrew Chi-Chih Yao

pp. 515-523

BibTeX  Abstract Full Text:  PDF

The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM's with Unary Input (Output) Alphabet and Applications

Oscar H. Ibarra

pp. 524-532

BibTeX  Abstract Full Text:  PDF

A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension

Theodore P. Baker

pp. 533-541

BibTeX  Abstract Full Text:  PDF